Recurrence and transience of a multi-excited random walk on a regular tree
نویسندگان
چکیده
We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition and provide a criterion for the recurrence/transience property of the walk. In particular, we prove that the asymptotic behaviour of the walk depends on the order of the excitations, which contrasts with the one dimensional setting studied by Zerner (2005). We also consider the limiting speed of the walk in the transient regime and conjecture that it is not a monotonic function of the environment.
منابع مشابه
A subdiffusive behaviour of recurrent random walk in random environment on a regular tree
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk (Xn) in random environment on a regular tree, which is closely related to Mandelbrot [13]’s multiplicative cascade. We prove, under some general assumptions up...
متن کاملExcited Random Walk in a Markovian Environment
One dimensional excited random walk has been extensively studied for bounded, i.i.d. cookie environments. In this case, many important properties of the walk including transience or recurrence, positivity or non-positivity of the speed, and the limiting distribution of the position of the walker are all characterized by a single parameter δ, the total expected drift per site. In the more genera...
متن کاملRandom Walk in a Random Environment and First-passage Percolation on Trees
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is lik...
متن کاملA combinatorial result with applications to self-interacting random walks
We give a series of combinatorial results that can be obtained from any two collections (both indexed by Z×N) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting random walk couplings, these allow us to reprove some known transience and recurrence results for some simple models. We also obtain new results for one-dimensional multi-e...
متن کاملMonotone interaction of walk and graph: recurrence versus transience*
We consider recurrence versus transience for models of random walks on growing in time, connected subsets Gt of some fixed locally finite, connected graph, in which monotone interaction enforces such growth as a result of visits by the walk (or probes it sent), to the neighborhood of the boundary of Gt.
متن کامل